A probabilistic remark on algebraic program testing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Probabilistic Remark on Algebraic Program Testing

Until very recently, research in software reliability has divided quite neatly into two usually warring camps: methodologies with a mathematical basis and methodologies without such a basis. In the former view, “reliability” is identified wi+h “correctness” and the principle tocl has been formal and informal verification [ 11. In the latter view, “reliability” is taken to mean the ability to me...

متن کامل

A remark on multivalued algebraic groups

We point out how suitable algebraic n-valued groups (in the sense of Buchstaber) give rise, in a reasonably canonical manner, to algebraic groups. This is proved using the “group configuration theorem” of Hrushovski. In particular this applies to all algebraic 2-valued groups.

متن کامل

A remark on algebraic immunity of Boolean functions

In this correspondence, an equivalent definition of algebraic immunity of Boolean functions is posed, which can clear up the confusion caused by the proof of optimal algebraic immunity of the Carlet-Feng function and some other functions constructed by virtue of Carlet and Feng’s idea.

متن کامل

A Remark on Algebraic Surfaces with Polyhedral Mori Cone

We denote by FPMC the class of all non-singular projective algebraic surfaces X over C with finite polyhedral Mori cone NE(X) ⊂ NS(X)⊗ R. If ρ(X) = rk NS(X) ≥ 3, then the set Exc(X) of all exceptional curves on X ∈ FPMC is finite and generates NE(X). Let δE(X) be the maximum of (−C ) and pE(X) the maximum of pa(C) respectively for all C ∈ Exc(X). For fixed ρ ≥ 3, δE and pE we denote by FPMCρ,δE...

متن کامل

A Remark on Primality Testing and the Binary Expansion

We show that for all sufficiently large integers n, a positive fraction of the primes p between 2 and 2 have the property that p− 2 and p+2 are composite for every 0 ≤ i < n − 1. As a consequence, it is not always possible to test whether a number is prime from its binary expansion without reading all of its digits.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Processing Letters

سال: 1978

ISSN: 0020-0190

DOI: 10.1016/0020-0190(78)90067-4